Quasi-Adaptive NIZK for Linear Subspaces Revisited
نویسندگان
چکیده
Non-interactive zero-knowledge (NIZK) proofs for algebraic relations in a group, such as the GrothSahai proofs, are an extremely powerful tool in pairing-based cryptography. A series of recent works focused on obtaining very efficient NIZK proofs for linear spaces in a weaker quasi-adaptive model. We revisit recent quasiadaptive NIZK constructions, providing clean, simple, and improved constructions via a conceptually different approach inspired by recent developments in identity-based encryption. We then extend our techniques also to linearly homomorphic structure-preserving signatures, an object both of independent interest and with many applications.
منابع مشابه
Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
We state a switching lemma for tests on adversarial responses involving bilinear pairings in hard groups, where the tester can effectively switch the randomness used in the test from being given to the adversary at the outset to being chosen after the adversary commits its response. The switching lemma can be based on any k-linear hardness assumptions on one of the groups. In particular, this e...
متن کاملNon-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
Verifiability is central to building protocols and systems with integrity. Initially, efficient methods employed the Fiat-Shamir heuristics. Since 2008, the Groth-Sahai techniques have been the most efficient in constructing non-interactive witness indistinguishable and zero-knowledge proofs for algebraic relations. For the important task of proving membership in linear subspaces, Jutla and Roy...
متن کاملSmooth NIZK Arguments with Applications to Asymmetric UC-PAKE and Threshold-IBE
We introduce a novel notion of smooth (-verifier) noninteractive zero-knowledge proofs (NIZK) which parallels the familiar notion of smooth projective hash functions (SPHF). We also show that the recent single group element quasi-adaptive NIZK (QA-NIZK) of Jutla and Roy (CRYPTO 2014) for linear subspaces can be easily extended to be computationally smooth. One important distinction of the new n...
متن کاملQA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
A sequence of recent works have constructed constant-size quasi-adaptive (QA) NIZK argu-ments of membership in linear subspaces of Ĝ, where Ĝ is a group equipped with a bilinear mape : Ĝ×Ȟ→ T. Although applicable to any bilinear group, these techniques are less useful in theasymmetric case. For example, Jutla and Roy (Crypto 2014) show how to do QA aggregation ofGroth-Sahai ...
متن کاملEfficient Quasi-Adaptive NIZK
This report gives an overview of the Quasi-Adaptive NonInteractive Zero Knowledge proof system introduced recent papers by Joy and Rutla ([JR13a,JR13b]). This system reduces the proof size for linear subspace languages to constant-sized proofs under the k-linear assumption.
متن کامل